Termination Proof Script
Consider the TRS R consisting of the rewrite rules
There is one dependency pair:
The approximated dependency graph contains one SCC:
{3}.
-
Consider the SCC {3}.
The usable rules are {2}.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 4, 2006